Token Jumping in Minor-Closed Classes
نویسندگان
چکیده
Given two k-independent sets I and J of a graph G, one can ask if it is possible to transform the one into the other in such a way that, at any step, we replace one vertex of the current independent set by another while keeping the property of being independent. Deciding this problem, known as the Token Jumping (TJ) reconfiguration problem, is PSPACE-complete even on planar graphs. Ito et al. proved in 2014 that the problem is FPT parameterized by k if the input graph is K3,l-free. We prove that the result of Ito et al. can be extended to any Kl,l-free graphs. In other words, if G is a Kl,l-free graph, then it is possible to decide in FPT-time if I can be transformed into J . As a by product, the TJ-reconfiguration problem is FPT in many well-known classes of graphs such as any minor-free class.
منابع مشابه
Reconfiguration on nowhere dense graph classes
In the token jumping problem for a vertex subset problem Q on graphs we are given a graph G and two feasible solutions Ss, St ⊆ V (G) of Q with |Ss| = |St|, and imagine that a token is placed on each vertex of Ss. The problem is to determine whether there exists a sequence S1, . . . , Sn of feasible solutions, where S1 = Ss, Sn = St and each Si+1 results from Si, 1 ≤ i < n, by moving exactly on...
متن کاملFixed-Parameter Tractability of Token Jumping on Planar Graphs
Suppose that we are given two independent sets I0 and Ir of a graph such that |I0| = |Ir|, and imagine that a token is placed on each vertex in I0. The token jumping problem is to determine whether there exists a sequence of independent sets which transforms I0 into Ir so that each independent set in the sequence results from the previous one by moving exactly one token to another vertex. This ...
متن کاملThin graph classes and polynomial-time approximation schemes
Baker [1] devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a fixed apex graph as a minor. Further generalizations (e.g., to all proper minor closed graph classes) are known, but they use a combination of techniques a...
متن کاملGrowth constants of minor-closed classes of graphs
A minor-closed class of graphs is a set of labelled graphs which is closed under isomorphism and under taking minors. For a minor-closed class G, let gn be the number of graphs in G which have n vertices. The growth constant of G is γ = lim sup(gn/n!) . We study the properties of the set Γ of growth constants of minor-closed classes of graphs. Among other results, we show that Γ does not contai...
متن کاملSome minor-closed classes of signed graphs
We define four minor-closed classes of signed graphs in terms of embeddability in the annulus, projective plane, torus, and Klein bottle. We give the full list of 20 excluded minors for the smallest class and make a conjecture about the largest class.
متن کامل